Big Data analysis via model reduction methods
نویسندگان
چکیده
منابع مشابه
Model order reduction via eigen decomposition analysis
In this paper, we have proposed a novel model order reduction technique via rational transfer function fitting and eigenmode analysis considering residues. We define a constant as a key in the sorting algorithm as one of correlations in order to sort the order of eigenvalues. It is demonstrated that the accuracy via eigenmode analysis considering residues is improved. The proposed algorithm is ...
متن کاملA Random Sample Partition Data Model for Big Data Analysis
Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) to represent a big data set as a set of non-overlapping data subsets, i.e. RSP data blocks, where each RSP data block has the same probability distribution with the whole big data s...
متن کاملBig Data and Specific Analysis Methods for Insurance Fraud Detection
Analytics is the future of big data because only transforming data into information gives them value and can turn data in business in competitive advantage. Large data volumes, their variety and the increasing speed their growth, stretch the boundaries of traditional data warehouses and ETL tools. This paper investigates the benefits of Big Data technology and main methods of analysis that can ...
متن کاملParallel Data Reduction Techniques for Big Datasets
Data reduction is perhaps the most critical component in retrieving information from big data (i.e., petascale-sized data) in many data-mining processes. The central issue of these data reduction techniques is to save time and bandwidth in enabling the user to deal with larger datasets even in minimal resource environments, such as in desktop or small cluster systems. In this chapter, the autho...
متن کاملRepresentation of big data by dimension reduction
Suppose the data consist of a set S of points xj , 1 ≤ j ≤ J , distributed in a bounded domain D ⊂ RN , where N and J are large numbers. In this paper an algorithm is proposed for checking whether there exists a manifold M of low dimension near which many of the points of S lie and finding such M if it exists. There are many dimension reduction algorithms, both linear and non-linear. Our algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: System research and information technologies
سال: 2018
ISSN: 2308-8893,1681-6048
DOI: 10.20535/srit.2308-8893.2018.2.04